Energy Saving in Flow-Shop Scheduling Management: An Improved Multiobjective Model Based on Grey Wolf Optimization Algorithm
نویسندگان
چکیده
منابع مشابه
An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملAn Efficient Ant Colony Optimization Algorithm for Multiobjective Flow Shop Scheduling Problem
In this paper an ant colony optimization algorithm is developed to solve the permutation flow shop scheduling problem. In the permutation flow shop scheduling problem which has been vastly studied in the literature, there are a set of machines and a set of jobs. All the jobs are processed on all the machines and the sequence of jobs being processed is the same on all the machines. Here this pro...
متن کاملAn Improved Fruit Fly Optimization Algorithm for Solving Lot-streaming Flow-shop Scheduling Problem
An improved fruit fly optimization algorithm (iFOA) is proposed in this paper for solving the lot-streaming flow-shop scheduling problem (LSFSP) with equal-size sub-lots. In the proposed iFOA, a solution is represented as two vectors to determine the splitting of jobs and the sequence of the sub-lots simultaneously. Based on the encoding scheme, three kinds of neighborhoods are developed for ge...
متن کاملAn Improved Clonal Algorithm in Multiobjective Optimization
In this paper, we develop a novel clonal algorithm for multiobjective optimization (NCMO) which is improved from three approaches, i.e., dynamic mutation probability, dynamic simulated binary crossover (D-SBX) operator and hybrid mutation operator combining with Gaussian and polynomial mutations (GP-HM operator). Among them, the GP-HM operator is controlled by the dynamic mutation probability. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2020
ISSN: 1563-5147,1024-123X
DOI: 10.1155/2020/9462048